On Monoids of Injective Partial Cofinite Selfmaps
نویسندگان
چکیده
منابع مشابه
Injective positively ordered monoids I
We define in this paper a certain notion of completeness for a wide class of commutative (pre)ordered monoids (from now on P.O.M.’s). This class seems to be the natural context for studying structures like measurable function spaces, equidecomposability types of spaces, partially ordered abelian groups and cardinal algebras. Then, we can prove that roughly speaking, spaces of measures with valu...
متن کاملInjective positively ordered monoids II
We continue in this paper the study of positively ordered monoids (P.O.M.’s) initiated in [39]. We prove that injective P.O.M.’s are the retracts of the powers of P=[0, ∞]. We also characterize the natural P.O.M.homomorphism from a given refinement P.O.M to its bidual, with e.g. applications to decomposition spaces. As another application, we prove that a refinement P.O.M admits a ‘Banach limit...
متن کاملInjective Hulls of Partially Ordered Monoids
We find the injective hulls of partially ordered monoids in the category whose objects are po-monoids and submultiplicative order-preserving functions. These injective hulls are with respect to a special class of monics called “embeddings”. We show as well that the injective objects with respect to these embeddings are precisely the quantales.
متن کاملCharacterizing Implications of Injective Partial Orders
It is known that implications in powerset-based closure systems correspond to Horn approximations in propositional logic frameworks. Here we focus on the problem of implications between injective partial orders. We set up the definitions that allow one to apply standard constructions of implications, and formally characterize the propositional theory obtained. We describe also some experimental...
متن کاملPartial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication × (and total identity 1P ) which satisfies some associativity axiom. The partial monoid P may be embedded in the free monoid P ∗ and the product × is simulated by a string rewriting system on P ∗ that consists in evaluating the concatenation of two letters as a product in P , when it is defined, and a letter 1P as the empty word ǫ. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Slovaca
سال: 2015
ISSN: 1337-2211,0139-9918
DOI: 10.1515/ms-2015-0067